Identifying Multiple Propagation Sources With Motif-Based Graph Convolutional Networks for Social Networks

نویسندگان

چکیده

Identifying the sources of propagation in social networks, such as misinformation propagation, is one key issues recently. Most existing studies assume underlying model known, which difficult to obtain practice. Recent efforts have been devoted detect multiple real-world situations, and influence neighbors assumed be identical. However, this assumption will result inaccurate results infection state a node determined by its critical neighbors. In paper, we fill gap capturing with structural properties networks. For instance, opinions are more likely spread via closely connected friends within small groups. Here propose Motif-based Graph Convolutional Networks for Source Identification (MGCNSI) framework based on GCN-based source identification approach. Specifically, different network motifs used capture types properties. Then each motif extracts particular type, motif-based graph convolutional layer constructed aggregate that motif. To adapt mechanisms, an attention mechanism aggregation designed automatically assign higher weights informative motifs. The empirical demonstrate MGCNSI outperforms several benchmark methods both synthetic advantage most obvious networks denser neighborhoods, where can select from larger neighbor sets. How paths also illustrated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstructing propagation networks with natural diversity and identifying hidden sources

Our ability to uncover complex network structure and dynamics from data is fundamental to understanding and controlling collective dynamics in complex systems. Despite recent progress in this area, reconstructing networks with stochastic dynamical processes from limited time series remains to be an outstanding problem. Here we develop a framework based on compressed sensing to reconstruct compl...

متن کامل

A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring

All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...

متن کامل

Dynamic Graph Convolutional Networks

Many different classification tasks need to manage structured data, which are usually modeled as graphs. Moreover, these graphs can be dynamic, meaning that the vertices/edges of each graph may change during time. Our goal is to jointly exploit structured data and temporal information through the use of a neural network model. To the best of our knowledge, this task has not been addressed using...

متن کامل

Graph Convolutional Networks

We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions. Our model scales linearly in the number of graph edges and learns hidden lay...

متن کامل

Identifying Users across Multiple Online Social Networks

An online user joins multiple social networks in order to enjoy different services. On each joined social network, she creates an identity and constitutes its three major dimensions namely profile, content and connection network. She largely governs her identity formulation on any social network and therefore can manipulate multiple aspects of it. With no global identifier to mark her presence ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3287214